Fibonacci numbers of the form p a ± p b Florian Luca
نویسنده
چکیده
In this paper, we show that the diophantine equation Fn = p ± p has only finitely many positive integer solutions (n, p, a, b), where p is a prime number and max{a, b} ≥ 2.
منابع مشابه
On perfect numbers which are ratios of two Fibonacci numbers ∗
Here, we prove that there is no perfect number of the form Fmn/Fm, where Fk is the kth Fibonacci number.
متن کاملAliquot sums of Fibonacci numbers
Here, we investigate the Fibonacci numbers whose sum of aliquot divisors is also a Fibonacci number (the prime Fibonacci numbers have this property).
متن کاملOn the First Digits of the Fibonacci Numbers and Their Euler Function
Here, we show that given any two finite strings of base b digits, say s1 and s2, there are infinitely many Fibonacci numbers Fn such that the base b representation of Fn starts with s1 and the base b representation of φ(Fn) starts with s2. Communicated by Oto Strauch
متن کاملDiophantine Triples with Values in the Sequences of Fibonacci and Lucas Numbers
Let FL = {1, 2, 3, 4, 5, 7, 8, 11, 13, 18, 21, . . .} be the set consisting of all Fibonacci and Lucas numbers with positive subscripts. We find all triples (a, b, c) of positive integers a < b < c such that ab + 1, ac+ 1, bc+ 1 are all members of FL.
متن کاملOn Factorials Expressible as Sums of at Most Three Fibonacci Numbers
In this paper, we determine all the factorials which are a sum of at most three Fibonacci numbers.
متن کامل